Perceptual constraints and the learnability of simple grammars.
نویسندگان
چکیده
Cognitive processes are often attributed to statistical or symbolic general-purpose mechanisms. Here we show that some spontaneous generalizations are driven by specialized, highly constrained symbolic operations. We explore how two types of artificial grammars are acquired, one based on repetitions and the other on characteristic relations between tones ("ordinal" grammars). Whereas participants readily acquire repetition-based grammars, displaying early electrophysiological responses to grammar violations, they perform poorly with ordinal grammars, displaying no such electrophysiological responses. This outcome is problematic for both general symbolic and statistical models, which predict that both types of grammars should be processed equally easily. This suggests that some simple grammars are acquired using perceptual primitives rather than general-purpose mechanisms; such primitives may be elements of a "toolbox" of specialized computational heuristics, which may ultimately allow constructing a psychological theory of symbol manipulation.
منابع مشابه
Lexicalized Well-Founded Grammars: Learnability and Merging
This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicalized Well-Founded Grammars, which are adequate for modeling human language and are learnable. These features make the grammars suitable for developing robust and scalable natural language understanding systems. Our grammars capture both syntax and semantics and have two types of constraints at the ...
متن کاملAn Investigation into the Effect of CEO’s Perceptual Biases on Investment Efficiency and Financing Constraints of the Iranian Listed Firms
Efficient market hypothesis predicts that capital markets are beset with cer-tain biases which result from wrong estimation, and negatively influence shareholders’ expectations for higher returns, which in turn affects invest-ment efficiency, financial constraints and corporate performance efficacy in competitive markets, and eventually mitigates firm value. The present study aims at examining ...
متن کاملUsing learnability as a filter on factorial typology: a new approach to Anderson and Browne’s generalization
This article investigates the learnability filter (LF) hypothesis, according to which the set of logically possible grammars predicted by linguistic theory is reduced to a proper subset of learnable grammars by external principles of language learning. Anti-faithfulness constraints (Alderete, 2001a) provide a linguistic theory that predicts the existence of circular chain shifts of two segment ...
متن کاملLearnability of Pregroup Grammars
This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...
متن کاملRecent Advances of Grammatical Inference
In this paper, we provide a survey of recent advances in the field “Grammatical Inference” with a particular emphasis on the results concerning the learnability of target classes represented by deterministic finite automata, context-free grammars, hidden Markov models, stochastic contextfree grammars, simple recurrent neural networks, and case-based representations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Cognition
دوره 105 3 شماره
صفحات -
تاریخ انتشار 2007